NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
461	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science
462	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
463	A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 NP-complete problems Constraint programming Logic in computer science Propositional calculus Unsatisfiable core Electronic design automation Boolean satisfiability problem Symmetry Satisfiability Theoretical computer science Mathematics Applied mathematics
464	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
465	3 in Three: Puzzle Solutions A Guide by John Franklin Version 1.01 — December 1, 2006 This Guide Is Formatted For Print! Multiple puzzle solutions may appear on the same page (and single solutions often Add to Reading List Source URL: www.thefoolsgold.com Language: English - Date: 2006-12-03 02:01:43 Puzzles Mechanical puzzles NP-complete problems Games 3 in Three T puzzle
466	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics
467	ICS 161 — Algorithms — Winter 1998 — Final Exam Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:50 NP-complete problems Mathematical optimization Analysis of algorithms Time complexity NP-complete Spreadsheet Approximation algorithm Algorithm Directed acyclic graph Theoretical computer science Applied mathematics Computational complexity theory
468	Mini-Indexes for Literate Programs Donald E. Knuth Computer Science Department, Stanford University, Stanford, CAUSA Abstract. This paper describes how to implement a documentation technique that helps reader Add to Reading List Source URL: www.literateprogramming.com Language: English - Date: 2007-10-09 02:22:30 Literate programming Graph theory NP-complete problems CWEB TeX Graph Extensible Storage Engine Permanent Vertex Mathematics Software Computing
469	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Inapproximability of Orthogonal Compaction Michael J. Bannister David Eppstein Joseph A. Simons Computer Science Department, Add to Reading List Source URL: jgaa.info Language: English - Date: 2012-03-09 04:02:51 NP-complete problems Graph coloring Topological graph theory Angular resolution Eulerian path Planar graph Graph Edge coloring Petersen graph Graph theory Mathematics Graph drawing
470	Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2012-12-26 15:36:44 Applied mathematics NP-complete problems Hypergraph Mathematical optimization Decomposition method Graph partition Dantzig–Wolfe decomposition Linear programming Block matrix Mathematics Theoretical computer science Operations research

UPDATE